Boundary Logic and Alpha Existential Graphs

نویسنده

  • William Bricken
چکیده

Peirce's Alpha Existential Graphs (AEG) is combined with Spencer Brown's Laws of Form to create an algebraic diagrammatic formalism called boundary logic. First, the intuitive properties of configurations of planar nonoverlapping closed curves are viewed as a pure boundary mathematics, without conventional interpretation. Void representational space provides a featureless substrate for boundary forms. Pattern-equations impose constraints on forms to define semantic interpretation. Patterns emphasize void-equivalence, deletion of structure that is syntactically irrelevant and semantically inert. Boundary logic maps one-to-many to propositional calculus. However, the three simple pattern-equations of boundary logic provide capabilities that are unavailable in token-based systems. Void-substitution replaces collection and rearrangement of forms. Patterns incorporate transparent boundaries that ignore the arity and scope of logical connectives. The algebra is isomorphic to AEG but eliminates difficulties with reading and with use by substituting a purely diagrammatic formalism for the logical mechanisms incorporated within AEG.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixing Shin's Reading Algorithm for Peirce's Existential Graphs

In her book “The Iconic Logic of Peirce’s Graphs”, S. J. Shin elaborates the diagrammatic logic of Peirce’s Existential Graphs. Particularly, she provides translations from Existential Graphs to first order logic. Unfortunately, her translation is not in all cases correct. In this paper, the translation is fixed by means of so-called single object ligatures.

متن کامل

Query Graphs with Cuts: Mathematical Foundations

Query graphs with cuts are inspired by Sowa’s conceptual graphs, which are in turn based on Peirce’s existential graphs. In my thesis ‘The Logic System of Concept Graphs with Negations’, conceptual graphs are elaborated mathematically, and the cuts of existential graphs are added to them. This yields the system of concept graphs with cuts. These graphs correspond to the closed formulas of first...

متن کامل

A Hierarchical Approach to Monadic Second-Order Logic over Graphs

The expressiveness of existential monadic second-order logic is investigated over several classes of nite graphs among them the graphs of bounded tree-width. A hierarchical approach to the decomposition of graphs is introduced which is related to the notion of tree decomposition. Among other results we show that existential monadic second-order logic on graphs of bounded tree-width is not close...

متن کامل

Second-Order Logic over Finite Structures - Report on a Research Programme

This talk will report on the results achieved so far in the context of a research programme at the cutting point of logic, formal language theory, and complexity theory. The aim of this research programme is to classify the complexity of evaluating formulas from different prefix classes of second-order logic over different types of finite structures, such as strings, graphs, or arbitrary struct...

متن کامل

The Genesis of Peirce’s Beta Part of Existential Graphs

Our paper concerns issues to do with the emergence of some of the most fundamental ideas in Peirce’s diagrammatic logic, many of them still unpublished. How did he gravitate at the diagrammatic approach to logic? It is best to frame this question by asking more precisely: How did he arrive at the full-fledged diagrammatic quantification, the theory that corresponds – or has been claimed to corr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006